Variance reduction by means of deterministic computation: Collision estimate
نویسنده
چکیده
In a recent paper, Heinrich (1995), a new variance reduction technique was introduced for the Monte Carlo solution of Fredholm integral equations. The idea, based on work in complexity theory, Heinrich and Mathé (1993), Heinrich (1994), consists in constructing a new equation sufficiently close to the original one and then applying standard schemes to both equations simultaneously. So the approach is a special case of the separation of main part (also called control variate) technique. As shown in Heinrich (1995), neighboring equations can be constructed by exploiting the system and the approximate solution of deterministic schemes of solving the equation. The gain in variance reduction can be controlled by the discretization error. Hence, by applying the Monte Carlo method with n samples, the overall error is essentially the deterministic discretization error multiplied by the classical Monte Carlo rate n−1/2 (see Heinrich and Mathé (1993), Heinrich (1994) for a theoretical foundation of this statement). Considerable improvements are possible this way as experiments in Heinrich (1995) showed.
منابع مشابه
Static Inductance Extraction by Means of the Monte Carlo Method and Variance Reduction Techniques for Acceleration
With increasing signal frequencies inductive effects of metallic interconnections in all kinds of packages become more and more important for the electrical performance of a circuit. During the design process it is therefore of interest to have a stable, fast and accurate simulation tool which is capable of extracting the inductance of large and complicated geometries. This work presents a new ...
متن کاملMonte Carlo Complexity of Parametric Integration
The Monte Carlo complexity of computing integrals depending on a parameter is analyzed for smooth integrands. An optimal algorithm is developed on the basis of a multigrid variance reduction technique. The complexity analysis implies that our algorithm attains a higher convergence rate than any deterministic algorithm. Moreover, because of savings due to computation on multiple grids, this rate...
متن کاملMonte Carlo Motion Planning for Robot Trajectory Optimization Under Uncertainty
This article presents a novel approach, named MCMP (Monte Carlo Motion Planning), to the problem of motion planning under uncertainty, i.e., to the problem of computing a low-cost path that fulfills probabilistic collision avoidance constraints. MCMP estimates the collision probability (CP) of a given path by sampling via Monte Carlo the execution of a reference tracking controller (in this pap...
متن کاملAn Efficiency Studying of an Ion Chamber Simulation Using Vriance Reduction Techniques with EGSnrc
Background: Radiotherapy is an important technique of cancer treatment using ionizing radiation. The determination of total dose in reference conditions is an important contribution to uncertainty that could achieve 2%. The source of this uncertainty comes from cavity theory that relates the in-air cavity dose and the dose to water. These correction factors are determined from Monte Carlo calcu...
متن کاملStochastic Congestion Management Considering Power System Uncertainties
Congestion management in electricity markets is traditionally done using deterministic values of power system parameters considering a fixed network configuration. In this paper, a stochastic programming framework is proposed for congestion management considering the power system uncertainties. The uncertainty sources that are modeled in the proposed stochastic framework consist of contingencie...
متن کامل